The graph sandwich problem for 1-join composition is NP-complete
نویسندگان
چکیده
منابع مشابه
The graph sandwich problem for 1-join composition is NP-complete
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR ; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no vertex of SL is adjacent to vertex of AR∪SR; no vertex of SR is adjacent to a vertex of AL∪SL. The graph sandwich problem for 1-join composition is de9ned as follows: Given a vertex set V , a forced edge set E, and a ...
متن کاملThe Graph Genus Problem is NP-Complete
The genus g(G) of a graph G is the smallest number g such that G can be embedded on the orientable surface of genus g. Given a graph G and a natural number k one may ask: Is g(G) I k? This problem, called the graph genus problem, is one of the remaining basic open problems, listed by Garey and Johnson 121, for which there is neither a polynomially bounded algorithm nor a proof that the problem ...
متن کاملAn Average Case NP-complete Graph Problem
NP-complete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under any samplable (i.e. generateable in polynomial time) distribution a...
متن کامل1 Evidence that Graph Isomorphism is not NP - Complete
Theorem 1 If GI is NP-complete, then the polynomial hierarchy collapses (specifically, PH = Σ2). Proof We first observe that AM ⊆ Π2 (why?). Now, assume GI is NP-complete. Then GNI is coNP-complete and hence (since GNI ∈ AM) we have coNP ⊆ AM. We show that this implies Σ2 ⊆ AM ⊆ Π2 and hence PH = Σ2. Say L ∈ Σ2. Then by definition of Σ2, there is a language L′ ∈ Π1 = coNP such that: (1) if x ∈ ...
متن کاملThe Maze Generation Problem is NP-complete
The Maze Generation problem has been presented as a benchmark for the Second Answer Set Programming Competition. We prove that the problem is NP–complete and identify relevant classes of unsatisfiable instances. The Maze Generation (MG) problem has been presented as a benchmark for the Second Answer Set Programming (ASP) Competition1. The problem has been placed in the NP category, which contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00246-3